Natural clustering: the modularity approach

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Natural clustering: the modularity approach

We show that modularity, a quantity introduced in the study of networked systems, can be generalized and used in the clustering problem as an indicator for the quality of the solution. The introduction of this measure arises very naturally in the case of clustering algorithms that are rooted in Statistical Mechanics and use the analogy with a physical system. PACS numbers: PACS Numbers: 02.50.R...

متن کامل

Enhancing Modularity-Based Graph Clustering

Graph clustering is defined as grouping the vertices of a given input graph into clusters. This article proposes a Two-Phase Modularity-Based Graph Clustering (2-PMGC) algorithm based on modularity optimization. The algorithm consists mainly of two steps; namely, coarsening and refinement. The coarsening phase takes the original graph as input and produces levels of coarsen graphs. The second p...

متن کامل

Modularity, noise, and natural selection.

Most biological systems are formed by component parts that are to some degree interrelated. Groups of parts that are more associated among themselves and are relatively autonomous from others are called modules. One of the consequences of modularity is that biological systems usually present an unequal distribution of the genetic variation among traits. Estimating the covariance matrix that des...

متن کامل

Modularity clustering is force-directed layout

Two natural and widely used representations for the community structure of networks are clusterings, which partition the vertex set into disjoint subsets, and layouts, which assign the vertices to positions in a metric space. This paper unifies prominent characterizations of layout quality and clustering quality, by showing that energy models of pairwise attraction and repulsion subsume Newman ...

متن کامل

Modularity-based Clustering for Network-constrained Trajectories

We present a novel clustering approach for moving object trajectories that are constrained by an underlying road network. The approach builds a similarity graph based on these trajectories then uses modularity-optimization hiearchical graph clustering to regroup trajectories with similar profiles. Our experimental study shows the superiority of the proposed approach over classic hierarchical cl...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Statistical Mechanics: Theory and Experiment

سال: 2007

ISSN: 1742-5468

DOI: 10.1088/1742-5468/2007/08/l08001